An explicit matrix algorithm for solving three-dimensional elastic wedge under surface loads
نویسندگان
چکیده
منابع مشابه
Design of an Elastic Arthroplastic Disc Optimized under Different Loads
Introduction: Due to limitations of current treatments for degenerative disc disease, arthroplastic methods to repair the diseased disc have been proposed. The artificial disc is a mobile implant for degenerative disc replacement that attempts to lessen the degeneration of the adjacent elements following interbody fusion procedures. Because the success of artificial disc replacement depends on ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولdesign of an elastic arthroplastic disc optimized under different loads
introduction: due to limitations of current treatments for degenerative disc disease, arthroplastic methods to repair the diseased disc have been proposed. the artificial disc is a mobile implant for degenerative disc replacement that attempts to lessen the degeneration of the adjacent elements following interbody fusion procedures. because the success of artificial disc replacement depends on ...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملgenetic algorithm based on explicit memory for solving dynamic problems
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Solids and Structures
سال: 2017
ISSN: 0020-7683
DOI: 10.1016/j.ijsolstr.2017.08.033